Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs
نویسندگان
چکیده
منابع مشابه
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs
Strongly perfect graphs have been studied by several authors (e.g. Berge and Duchet [1], Ravindra [12], Wang [14]). In a series of two papers, the current paper being the first one, we investigate a fractional relaxation of strong perfection. Motivated by a wireless networking problem, we consider claw-free graphs that are fractionally strongly perfect in the complement. We obtain a forbidden i...
متن کاملClaw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures
Strongly perfect graphs have been studied by several authors (e.g., Berge andDuchet (1984) [1], Ravindra (1984) [7] and Wang (2006) [8]). In a series of two papers, the current paper being the second one, we investigate a fractional relaxation of strong perfection. Motivated by a wireless networking problem, we consider claw-free graphs that are fractionally strongly perfect in the complement. ...
متن کاملClaw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version
Strongly perfect graphs have been studied by several authors (e.g., Berge and Duchet [1], Ravindra [7], Wang [8]). In a series of two papers, the current paper being the second one, we investigate a fractional relaxation of strong perfection. Motivated by a wireless networking problem, we consider claw-free graphs that are fractionally strongly perfect in the complement. We obtain a forbidden i...
متن کاملClaw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...
متن کاملClaw-free graphs. I. Orientable prismatic graphs
A graph is prismatic if for every triangle T , every vertex not in T has exactly one neighbour in T . In this paper and the next in this series, we prove a structure theorem describing all prismatic graphs. This breaks into two cases depending whether the graph is 3-colourable or not, and in this paper we handle the 3-colourable case. (Indeed we handle a slight generalization of being 3-coloura...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.06.024